Modular Automata 2 Distributed Petri Nets 4 Synthesis
نویسندگان
چکیده
Modular automata are symbolic transition systems halfway between families of automata and their synchronized products. They allow for analysis of liveness properties without incurring the state space explosion problem. A modular automaton is composed of modules and a synchronization graph. We consider the problem whether such specifications may be implemented by a distributed Petri net up to language equivalence. The challenge is to avoid computing the state space of the modular automaton to be implemented. We show that this is possible, opening the way to the synthesis of nets from modular specifications. Key-words: modular automaton, synchronized product, distributed Petri net, modular synthesis, regular languages, linear systems
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملSynthesizing Petri nets from LTL specifications – An engineering approach
In this paper we present a pattern-based approach for synthesizing truly distributed Petri nets from a class of LTL specifications. The synthesis allows for the automatic, correct generation of humanly conceivable Petri nets, thus circumventing a manual construction of nets, or the use of Büchi automata which are not distributed and often less intuitive to understand.
متن کاملGeneralized Asynchronous Systems
The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asyn-chronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns tim...
متن کاملSplitting of Actions , Higher - Dimensional Automata , and Net Synthesis Eric Badouel
The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...
متن کاملSplitting of Actions, Higher-Dimensional Automata, and Net Synthesis
The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...
متن کامل